Method for generating, operating, and using a sparse w-NAF key for encryption

ABSTRACT

A method for generating, operating, and using a sparse w-NAF key for encryption is disclosed. The method for generating a key comprises generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2 w  (w being a natural number equal to or more than 2); and outputting the generated string as a key. Accordingly, an encryption is executed through an exponential operation or scalar multiplication using a sparse w-NAF key having the scarce coefficients, excluding 0, such that an encryption pace is improved.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit under 35 U.S.C. §119(a) of Korean Patent Application No. 2006-120827, filed Dec. 1, 2006, in the Korean Intellectual Property Office, the entire disclosure of which is hereby incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a method for generating a key. More particularly, the present invention relates to a method for generating a key, which reduces computational complexity accompanying an encryption, and a method for operating and encrypting using the generated key.

2. Description of the Related Art

The increased importance of information security has brought many proposals for encryption. Diffie-Hellman (DH) encryption and Elliptic Curve Cryptography (ECC) are examples of encryption methods proposed for more effective information security.

The Diffie-Hellman (DH) encryption involves exponential operations in the process of encryption. There are also many other different methods for encryption which involve exponential operation.

For more stable information security, a length of key to be an exponent in exponential operation has to be sufficiently long. However, if the key to be an exponent is lengthened, more exponential computations are required such that an operation pace is slowed. A lowered operation pace is more severe in mobile devices which have slower processors.

ECC involves scalar multiplication in the process of encryption.

In the case of ECC, the length of the key as a coefficient being multiplied on a coordinate in scalar multiplication has to be long enough for more stable information security. However, if the key is lengthened, more scalar multiplication computations are required, such that the operation is slowed. The falling-off in operating pace is more severe in the mobile devices which have slower processors.

Accordingly, there is a need for an improved method for generating a key which increases encryption pace by reducing the computational complexity accompanying the encryption.

SUMMARY OF THE INVENTION

Exemplary embodiments of the present invention address at least the above problems and/or disadvantages and provide at least the advantages described below. Accordingly, an aspect of exemplary embodiments of the present invention provides a method for generating a sparse w-NAF key, which improves encryption pace by reducing computations for exponential operation or Scalar multiplication, a method for operating an exponential operation or a scalar multiplication using a sparse w-NAF key and executing an encryption using the same.

In order to achieve the above object, a method for generating a key according to exemplary embodiments of the invention may comprise, a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) outputting the generated string as a key.

Exemplary embodiments of the present invention also provide that generating the string may comprise, a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string of coefficients comprising a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the key. Wherein, m and t may be positive integers.

Exemplary embodiments of the present invention provide that the positive odd integers equal to or less than 2^(w) of the string may follow (w−1) zeros.

Exemplary embodiments of the present invention also provide that the outputting of the generated string comprises excluding the coefficients ahead of the first coefficient, excluding 0, of the generated string.

In accordance with an aspect of exemplary embodiments of the present invention, a method for exponential operation comprises, a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) executing an exponential operation using the generated key as an exponent.

Exemplary embodiments of the present invention also provide that the generating of the key may comprise, a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing unselected groups with zeros and generating a key.

In accordance with an aspect of exemplary embodiments of the present invention, a method for encryption comprises, a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); b) executing an exponential operation using the generated key as an exponent; and c) executing encryption using the value of exponential operation.

Exemplary embodiments of the present invention also provide that the generating of the key may comprise, a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising of a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the key.

In accordance with an aspect of exemplary embodiments of the present invention, a method for generating a key comprises, a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and b) outputting the generated string as a key.

Exemplary embodiments of the present invention also provide that the generating of the string may comprise, a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the string, wherein m and t may be positive integers.

Exemplary embodiments of the present invention provide that non-divisible integers by q with absolute value equal to or less than q^(w)/2 may follow (w−1) zeros.

Exemplary embodiments of the present invention also provide that the outputting of the generated string outputs a string excluding the coefficients ahead of the first coefficient, excluding 0, of the generated string as the key.

In accordance with an aspect of exemplary embodiments of the present invention, a method for scalar multiplication comprises, a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and b) executing scalar multiplication on the basis of the key.

Exemplary embodiments of the present invention provide that the generating of the key may comprise, a1) selecting the t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2 and (w−1) zeros; and a3) generating the string by replacing unselected groups with zeros, wherein m and t may be positive integers.

In accordance with an aspect of exemplary embodiments of the present invention, a method for encryption comprises, a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; b) executing scalar multiplication on the basis of the generated key; and c) executing the encryption using the value of scalar multiplication.

Exemplary embodiments of the present invention provide that the generating of the key may comprise, a1) selecting the t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the key, wherein m and t may be positive integers.

An exemplary embodiment of a computer-readable recording media is provided, which writes a program for executing a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) outputting the generated string as a key.

An aspect of exemplary embodiments of the present invention provide a computer-readable recording medium storing a program, comprising a) generating a string of a consecutive w number of coefficients, in which at most one coefficient, excluding 0, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and b) outputting the generated string as a key.

Another aspect of exemplary embodiments of the present invention provide an encryption device comprising a key generator for generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2), an exponential operator for executing exponential operation using the generated key as an exponent, and an encryption part executing encryption using the value of exponential operation.

In another exemplary embodiment, an encryption device comprises, a key generator generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2, a scalar multiplier executing scalar multiplication on the basis of the generated key, and an encryption part executing the encryption using value of scalar multiplication.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other aspects, features, and advantages of certain embodiments of the present invention will be more apparent from the following description taken in conjunction with the accompanying drawings, in which:

FIG. 1 is a block diagram illustrating an encryption device according to an exemplary embodiment of the present invention;

FIG. 2 is flowchart illustrating a method for encryption according to an exemplary embodiment of the present invention;

FIG. 3 is a block diagram illustrating an encryption device according to another exemplary embodiment of the present invention; and

FIG. 4 is a flowchart illustrating a method for encryption according to another exemplary embodiment of the present invention.

Throughout the drawings, the same drawing reference numerals will be understood to refer to the same elements, features, and structures.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

The matters defined in the description such as a detailed construction and elements are provided to assist in a comprehensive understanding of the embodiments of the invention and are merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

Exemplary embodiments of the present invention will be explained in more detail with reference to the drawings.

FIG. 1 is a block diagram illustrating an encryption device according to an exemplary embodiment of the present invention. According to an exemplary embodiment of the present invention, the encryption device generates and uses a key to reduce exponential computations.

As illustrated in FIG. 1, the encryption device in accordance with an exemplary embodiment of the present invention may comprise a key generator 100, an exponential operator 200, and an encryption part 300.

The key generator 100 generates an Unsigned w-Non Adjacent Form (w-NAF) key.

A w-NAF key satisfies the following conditions:

-   -   1) coefficient, excluding 0, is a positive odd integer with an         absolute value equal to or less than 2^(w−1) (w being a natural         number equal to or more than 2), and     -   2) Of a string of a consecutive w number of coefficients, at         most one coefficient, excluding 0.

The absolute value of coefficients, excluding 0 is an odd integer equal to or less than 2^(w−1) such that a w-NAF key is the set of integers which include a negative odd integer. And, a consecutive w number of coefficients, at most one is coefficient, excluding 0, such that the number of coefficients, excluding 0, of consecutive w number of coefficients of a w-NAF key is either 1 or 0.

The Unsigned w-NAF key satisfies the following conditions:

-   -   1) coefficient, excluding 0, is a positive odd integer equal to         or less than 2^(w) (w is a natural number equal to or more         than 2) and,     -   2) Of a string of a consecutive w number of coefficients, at         most one coefficient, excluding 0.

The Unsigned w-NAF key is different from the w-NAF key in that not the absolute value of the coefficients, excluding 0, but the coefficients, excluding 0, themselves are the positive odd integers equal to or less than 2^(w). In other words, the Unsigned w-NAF key is a set of integers which do not include a negative odd integer, but the w-NAF key may consist of a negative odd integer.

The exponential operator 200 executes an exponential operation using the Unsigned w-NAF key as an exponent and outputs an operation value.

The encryption part 300 executes encryption with the value of the exponential operation outputted from the exponential operator 200.

Herein below, i) the process of generating an Unsigned w-NAF key, ii) the process of executing an exponential operation using the Unsigned w-NAF key as an exponent, and iii) the process of executing an encryption with the value of exponential operation, are described in detail with reference to FIG. 2.

FIG. 2 is a flowchart illustrating a method for encryption according to an exemplary embodiment of the present invention.

Referring to FIG. 2, the key generator 100 selects t groups from (m−(w−1)*t) groups (S110), where, i) m is the number of coefficients consisting of an Unsigned w-NAF key to generate, ii) w is the number of coefficients consisting of selected groups, which is a positive integer equal to or more than 2, and iii) t is the number of coefficients, excluding 0 which are positive integers, among coefficients of an Unsigned w-NAF key.

For example, it is assumed that m (the number of coefficients of an Unsigned w-NAF key)=20, w (the number of coefficients of a selected group)=4, and t (the number of coefficients, excluding 0, among coefficients of an Unsigned w-NAF key)=3.

In this implementation, the key generator 100 selects t (=3) groups (k₆, k₈, k₁₁) from the (m−(w−1)*t=20−(4−1)*3=11) groups (k₁, k₂, k₃, k₄, k₅, k₆, k₇, k₈, k₉, k₁₀, k₁₁).

The key generator 100 replaces respective selected t groups with a string which is set of positive odd integer equal to or less than 2^(w), and (w−1) zeros (S120). The substitute string at S120 includes one of positive odd integers equal to or less than 2^(w) following (w−1) zeros.

The key generator 100 replaces unselected groups with zeros (S130).

That is, the key generator 100 at S120 replaces the respective selected (t=3) groups with a string which includes (w−1=4−1=3) zeros and one positive odd integer equal to or less than 2^(w) (positive odd integers equal to or less than 2⁴: 1, 3, 5, 7, 9, 11, 13, 15).

For example, the key generator 100 at S130 may replace group k₆ with 0001, k₈ with 0005, and k₁₁ with 0003.

The key generator 100 replaces the respective unselected groups k₁, k₂, k₃, k₄, k₅, k₇, k₉, k₁₀ with zeros. As a value of the operation at S120 and S130, “k₁ k₂ k₃ k₄ k₅ k₆ k₇ k₈ k₉ k₁₀ k₁₁” are replaced with “0 0 0 0 0 0001 0 0005 0 0 0003”.

The key generator 100 outputs the coefficients generated through S110 to S130 as the Unsigned w-NAF key (S140). That is, the key generator 100 outputs “00000000100005000003” as the Unsigned w-NAF key.

The exponential operator 200 executes exponential operation using the Unsigned w-NAF key generated at the key generator 100 as an exponent (S 210 to S260), which is described below.

First of all, the exponential operator 200 sets an exponential value (g^(the first coefficient, excluding 0)) as described below. The first coefficient, excluding 0, among coefficients of an Unsigned w-NAF key is an exponent, and g is a base (S210). That is, if the Unsigned w-NAF key is “00000000100005000003”, the first coefficient, excluding 0, “1” (that is, 9^(th) coefficient) of “00000000100005000003” is the exponent, and g is the base such that “g¹” is obtained as the exponential value (y).

Next, if a following coefficient is 0 (S220-Y), the exponential operator 200 determines a square value (y²) of the exponential value (y) to be a new exponential value (y) (S230).

That is, the exponential value (y=g¹) is replaced with a new exponential value (y=g²=(g¹)²), because the 10^(th) coefficient following the 9^(th) coefficient “1” is “0” in “00000000100005000003”. Also because the 11^(th) coefficient is “0”, the exponential value (y=g²) is replaced with a new exponential value (y=g⁴=(g²)²), because the 12^(th) coefficient is “0”, the exponential value (y=g⁴) is replaced with new exponential value (y=g⁸=(g⁴)²), and because the 13^(th) coefficient is “0”, exponential value (y=g⁸) is replaced with a new exponential value (y=g¹⁶=(g⁸)²).

Meanwhile, if a following coefficient is coefficient, excluding 0, (S220-N), the exponential operator 200 replaces the exponential value (y) with a new exponential value (y) based on a value (y²*g^(following coefficient)) multiplying square value of exponent by (g^(following coefficient)).

That is, the exponential value (y=g¹⁶) is replaced with a new exponential value (y=g³⁷=(g¹⁶)²*g⁵), because 14^(th) coefficient following the 13^(th) coefficient “0” is “5” in “00000000100005000003”.

Operations S220 to S240 reiterate until there is no following coefficient (S250). That is, S220 to S240 is terminated when there is no following coefficient of the Unsigned w-NAF key.

If there is no following coefficient (that is, if the exponential operation is terminated) (S250-N), the exponential operator 200 outputs the exponential value (y) as the value of exponential operation (S260).

The encryption part 300 executes an encryption of the value outputted from the exponential operator 200 (S310).

So far, the operations of the encryption device of FIG. 1 were explained with reference to the FIG. 2, including i) the process of generating the Unsigned w-NAF key, ii) the process of executing exponential operation using the Unsigned w-NAF key as an exponent, and iii) the process of executing encryption with the value of exponential operation.

In the above exemplary embodiment, operation S120 replaces the respective selected t groups with a string consisting of (w−1) zeros and one of the positive odd number equal to or less than 2^(w). In an alternative embodiment of the present invention, the first string may exclude (w−1) zeros. That is, the first string may be “1” instead of “0001”.

Moreover, operation S140 of the above exemplary embodiment outputs the string generated at S110 to S130 as the Unsigned w-NAF key. In an alternative embodiment, it is possible to output a string excluding the coefficients ahead of the first coefficient, excluding 0, of the string generated at S110 to S130 as the Unsigned w-NAF key. That is, “100005000003” may be outputted as the Unsigned w-NAF key, which is a string excluding the zeros (1^(st) coefficient to 8^(th) coefficient) ahead of the first coefficient, excluding 0, “1” (9^(th) coefficient) of “00000000100005000003” of the string generated at S110 to S130.

Hereinafter, another exemplary embodiment of the present invention is explained in detail with reference to the FIGS. 3 and 4. FIG. 3 is a block diagram of an encryption device according to another exemplary embodiment of the present invent. The encryption device according to the exemplary embodiment generates and uses a key to reduce computational complexity of the scalar multiplication on an ellipse curve in executing the encryption.

Referring to FIG. 3, the encryption device according to an exemplary embodiment of the present invention includes a key generator 400, a scalar multiplier 500, and an encryption part 600.

The key generator 400 generates a ‘τ-adic w-NAF’ key. The ‘w-NAF’ is described above and, ‘τ’ means (x, y)→(x^(q), y^(q)) of Frobenius endomorphism map. The ‘τ-adic w-NAF’ is a form of combining ‘τ’ with ‘w-NAF’.

The ‘τ-adic w-NAF’ key satisfies the following conditions:

-   -   1) coefficient, excluding 0, is non-divisible integer by q with         an absolute value equal to or less than q^(w)/2, and     -   2) Of a string of a consecutive w number of coefficients, at         most one coefficient, excluding 0.

The scalar multiplier 500 executes a scalar multiplication on the basis of a τ-adic w-NAF key generated by the key generator 400, and outputs the value.

The encryption part 600 executes an encryption using the value outputted from the scalar multiplier 500.

The following describes i) the process of generating τ-adic w-NAF key, ii) the process of executing scalar multiplication on the basis of the τ-adic w-NAF key, and iii) the process of executing the encryption using the value of scalar multiplication, with reference to the FIG. 4.

FIG. 4 is a flowchart illustrating a method for encryption according to another exemplary embodiment of the present invention.

Referring to FIG. 4, the key generator 400 selects t groups from (m−(w−1)*t) groups (S410) where, i) m is an integer related to the number of coefficients of a τ-adic w-NAF key to generate, ii) w is the number of coefficients of selected groups and a positive integer equal to or more than 2, and iii) t is the number of coefficients, excluding 0, among coefficients of a τ-adic w-NAF key and a positive integer.

The key generator 400 replaces the selected respective t groups with a string which consists of a non-divisible integer by q with an absolute value equal to or less than q^(w)/2, and (w−1) zeros (S420). The substitute string at operation S420 is a string which consists of a non-divisible integer by q with absolute value equal to or less than q^(w)/2 following (w−1) zeros.

The key generator 400 replaces the unselected groups with zeros (S430), and outputs coefficients generated at S410 to S430 as the τ-adic w-NAF key (S440).

The scalar multiplier 500 executes the scalar multiplication on the basis of the τ-adic w-NAF key generated by the key generator 400 (S510 to S560). The operation will be described in detail below.

First of all, the scalar multiplier 500 searches the first coefficient, excluding 0, among coefficients of the τ-adic w-NAF key, and sets [sign(the first coefficient, excluding 0]*|the first coefficient, excluding 0|*P to be an interim value(Q) (S510).

Accordingly, i) if x is positive, sign(x)=1, ii) if x is negative, sign(x)=−1 and, iii) if x is zero, sign(x)=0. So, i) if the first coefficient, excluding 0, is positive, sign(the first coefficient, excluding 0)=1, and ii) if the first coefficient, excluding 0, is negative, sign(the first coefficient, excluding 0)=−1, where sign(x) is a function representing a sign of x.

If a following coefficient is zero (S520-Y), the scalar multiplier 500 replaces the interim value (Q) with a new interim value (τQ), which is obtained by applying Frobenius endomorphism map to the interim value (Q) (S530).

Meanwhile, if a following coefficient is coefficient, excluding 0, (S520-N), the scalar multiplier 500 replaces the interim value (Q) with a new interim value (τQ+[sign(following coefficient)]*|following coefficient|*P), which is obtained by adding a value (τQ) obtained by applying Frobenius endomorphism map with [sign(following coefficient)]*|following coefficient|*P (S540).

Operations S520 to S540 reiterate until there is no following coefficient (S550). That is, S520 to S540 is terminated when there is no following coefficient of the τ-adic w-NAF key.

If there is no following coefficient (that is, if the scalar multiplication is terminated) (S550-N), the scalar multiplier 500 outputs the interim value (Q) as the value of the scalar multiplication (S560).

Accordingly, the encryption part 600 executes the encryption using the value of scalar multiplication outputted from the scalar multiplier 500 (S610).

So far, operations of the encryption device of FIG. 3 were explained with reference to the FIG. 4, including i) the process of generating the τ-adic w-NAF key, ii) the process of executing the scalar multiplication on the basis of the τ-adic w-NAF key, and iii) the process of executing the encryption using the value of the scalar multiplication.

Operation S420 of the above exemplary embodiment replaces a selected respective t groups with a string which consists of a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros. In an alternative embodiment, the first string may exclude (w−1) zeros.

Also, operation S440 of the exemplary embodiment outputs the string generated at S410 to S430 as the τ-adic w-NAF key. In an alternative embodiment, it is possible to output a string excluding the coefficients ahead of the first coefficient, excluding 0, of string generated at S410 to S430 as the τ-adic w-NAF key.

Meanwhile, i) the method for generating a sparse w-NAF key such as the Unsigned w-NAF key or the τ-adic w-NAF key, ii) the method for executing exponential operation or the scalar multiplication using sparse w-NAF key as an exponent, and iii) the method for executing the encryption using operation value, can also be embodied as computer-readable codes on a computer-readable recording medium. The computer-readable recording medium is any data storage device that can store data which can thereafter be read by a computer system. Examples of the computer-readable recording medium include, but are not limited to, read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tapes, floppy disks, optical data storage devices, and carrier waves (such as data transmission through the Internet via wired or wireless transmission paths). The computer-readable recording medium can also be distributed over network-coupled computer systems so that the computer-readable code is stored and executed in a distributed fashion. Also, functional programs, codes, and code segments for accomplishing the present invention can be easily construed as within the scope of the invention by programmers skilled in the art to which the present invention pertains. As it will be embodied readily on the basis of the above contents by one skilled in the art, detailed description thereof will be omitted for clarity and conciseness.

An embodiment of the present invention may be applicable to an electronic device which is capable of implementing a key generation, an exponential operation, a scalar multiplication, or an encryption. The electronic device also may include mobile devices of low computational complexity.

As described above, in exemplary embodiments of the present invention, an encryption is executed through exponential operation or scalar multiplication using a sparse w-NAF key such as an ‘Unsigned w-NAF key’ or a ‘τ-adic w-NAF key’ having the scarce coefficients, excluding 0. Accordingly, a computational complexity of exponential operation or scalar multiplication can be reduced such that an encryption pace is improved.

While certain exemplary embodiments of the invention have been shown and described herein with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims and their equivalents. 

1. A method for generating a key, comprising the steps of: a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) outputting the generated string as a key.
 2. The method of claim 1, wherein the generating the string comprises: a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string of coefficients comprising a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing the unselected groups with zeros and generating the string, wherein m and t are positive integers.
 3. The method of claim 2, wherein one of the positive odd integers is equal to or less than 2^(w) of the string follows (w−1) zeros.
 4. The method of claim 1, wherein outputting the generated string comprises excluding the coefficients ahead of the first coefficient, excluding 0, of the generated string.
 5. A method for exponential operation, comprising the steps of: a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) executing an exponential operation using the generated key as an exponent.
 6. The method of claim 5, wherein the generating the key comprises: a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing unselected groups with zeros and generating a key.
 7. A method for encryption, comprising the steps of: a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); b) executing an exponential operation using the generated key as an exponent; and c) executing encryption using the value of exponential operation.
 8. The method of claim 7, wherein generating the key comprises: a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a positive odd integer equal to or less than 2^(w) and (w−1) zeros; and a3) replacing an unselected groups with zeros and generating the key.
 9. A method for generating a key, comprising the steps of: a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and b) outputting the generated string as a key.
 10. The method of claim 9, wherein generating the string comprises: a1) selecting t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the string, wherein m and t are positive integers.
 11. The method of claim 10, wherein non-divisible integers by q with absolute value equal to or less than q^(w)/2 may follow (w−1) zeros.
 12. The method of claim 9, wherein outputting the generated string outputs a string excluding the coefficients ahead of the first coefficient, excluding 0, of the generated string as the key.
 13. A method of scalar multiplication, comprising the steps of: a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and b) executing scalar multiplication on the basis of the key.
 14. The method of claim 13, wherein the generating a) the key comprises: a1) selecting the t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros; and a3) generating the string by replacing unselected groups with zeros, wherein m and t are positive integers.
 15. A method for encryption, comprising the steps of: a) generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; b) executing scalar multiplication on the basis of the generated key; and c) executing the encryption using the value of scalar multiplication.
 16. The method of claim 15, wherein the generating the key comprises: a1) selecting the t groups from (m−(w−1)*t) groups; a2) replacing the respective selected t groups with a string comprising a non-divisible integer by q with absolute value equal to or less than q^(w)/2, and (w−1) zeros; and a3) replacing unselected groups with zeros and generating the key, wherein m and t are positive integers.
 17. A computer-readable recording media, which writes thereon a program for executing: a) generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); and b) outputting the generated string as a key.
 18. A computer-readable recording medium storing a program, comprising: a first set of instructions for generating a string of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; and a second set of instructions for outputting the generated string as a key.
 19. An encryption device, comprising: a key generator for generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a positive odd integer equal to or less than 2^(w) (w being a natural number equal to or more than 2); an exponential operator for executing an exponential operation using the generated key as an exponent; and an encryption part for executing encryption using the value of exponential operation.
 20. An encryption device, comprising: a key generator for generating a key of a number of coefficients, in which at most one coefficient, excluding 0, among a consecutive w number of coefficients, corresponds to a non-divisible integer by q with an absolute value equal to or less than q^(w)/2; a scalar multiplier for executing scalar multiplication on the basis of the generated key; and an encryption part for executing the encryption using value of scalar multiplication. 